Characterizing discrete vector lattices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An equivalence functor between local vector lattices and vector lattices

We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...

متن کامل

Characterizing Trees in Concept Lattices

Concept lattices are systems of conceptual clusters, called formal concepts, which are partially ordered by the subconcept/superconcept relationship. Concept lattices are basic structures used in formal concept analysis. In general, a concept lattice may contain overlapping clusters and need not be a tree. On the other hand, tree-like classification schemes are appealing and are produced by sev...

متن کامل

Discrete time Bogoyavlensky lattices

Discretizations of the Bogoyavlensky lattices are introduced, belonging to the same hierarchies as the continuous–time systems. The construction exemplifies the general scheme for integrable discretization of systems on Lie algebras with r–matrix Poisson brackets. An initial value problem for the difference equations is solved in terms of a factorization problem in a group. Interpolating Hamilt...

متن کامل

Truncated Vector Lattices

In analysis, truncation is the operation of replacing a nonnegative real-valued function a (x) by its pointwise meet a (x) ∧ 1 with the constant 1 function. A vector lattice A is said to be closed under truncation if a ∧ 1 ∈ A for all a ∈ A. Note that A need not contain 1 itself. Truncation is fundamental to analysis. To give only one example, Lebesgue integration generalizes beautifully to any...

متن کامل

Characterizing trees in property-oriented concept lattices

Property-oriented concept lattices are systems of conceptual clusters called property-oriented concepts, which are partially ordered by the subconcept/superconcept relationships. Property-oriented concept lattices are basic structures used in formal concept analysis. In general, a property-oriented concept lattice may contain overlapping clusters and is not to be a tree construction. Additional...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1974

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-31-2-235-242